Processor-Minimum Scheduling of Real-Time Parallel Tasks
نویسندگان
چکیده
منابع مشابه
Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor
In this paper, we consider the preemptive scheduling of hard-real-time sporadic task systems on one processor. We rst give necessary and su cient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested e ciently (unless P =NP). They do, however, lead to a feasibility test that runs in e cient pseudo-polynomial time for a very large ...
متن کاملScheduling Hard Real-Time Tasks with 1-Processor-Fault-Tolerance
Real-time systems are being extensively used in applications that are mission-critical and life-critical, such as space exploration, aircraft avionics, and robotics. Since these systems are usually operating in environments that are non-deterministic, and even hazardous, it is extremely important that hard deadlines of tasks be met even in the presence of certain failures. To tolerate processor...
متن کاملReal-Time Scheduling of Linear Speedup Parallel Tasks
In this paper a problem of deterministic scheduling parallel applications in a multiprogrammed multiprocessor system is considered. We address the preemptive case. The number of processors used by a task can change over time. Any task can be executed with linear speedup on a number of processors not greater than some task-dependent constant. This problem can be solved by a low-order polynomial ...
متن کاملGlobal Edf Scheduling for Parallel Real-time Tasks Contents
As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this thesis, we consider the Global Earliest Deadline First (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be represented by a directed acyclic gr...
متن کاملReservation-Based Federated Scheduling for Parallel Real-Time Tasks
This paper considers the scheduling of parallel realtime tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.723